State-space dynamics distance for clustering sequential data
نویسندگان
چکیده
منابع مشابه
State-space dynamics distance for clustering sequential data
This paper proposes a novel similarity measure for clustering sequential data. We first construct a common state space by training a single probabilisticmodelwith all the sequences in order to get a unified representation for the dataset. Then, distances are obtained attending to the transition matrices induced by each sequence in that state space. This approach solves some of the usual overfit...
متن کاملAdaptive distance measures for sequential data
Recent extensions of learning vector quantization (LVQ) to general (dis-)similarity data have paved the way towards LVQ classifiers for possibly discrete, structured objects such as sequences addressed by classical alignment. In this contribution, we propose a metric learning scheme based on this framework which allows for autonomous learning of the underlying scoring matrix according to a give...
متن کاملEntropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملA Scalable Algorithm for Clustering Sequential Data
Many scienti c and commercial domains have seen an enormous growth of data in recent years. Such data sets have inherent sequential nature. The clustering of such data is useful for various purposes. Over the years, many methods have been developed for clustering objects according to their similarity. However, in contexts of sequential data these methods tend to have a computational complexity ...
متن کاملRough clustering of sequential data
This paper presents a new indiscernibility-based rough agglomerative hierarchical clustering algorithm for sequential data. In this approach, the indiscernibility relation has been extended to a tolerance relation with the transitivity property being relaxed. Initial clusters are formed using a similarity upper approximation. Subsequent clusters are formed using the concept of constrained-simil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2011
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2010.11.018